Walk the line: Pedestrian distraction and cross walk safety

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Walk on the Line

Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider quantum walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example of a typical walk, the “Hadamard walk”. In particular, we show that after t time steps, the probability distribution on the line induced by the Hadamard walk ...

متن کامل

Random walk versus random line

Joël De Coninck, François Dunlop, Thierry Huillet Abstract: We consider random walks Xn in Z+, obeying a detailed balance condition, with a weak drift towards the origin when Xn ր ∞. We reconsider the equivalence in law between a random walk bridge and a 1+1 dimensional Solid-On-Solid bridge with a corresponding Hamiltonian. Phase diagrams are discussed in terms of recurrence versus wetting. A ...

متن کامل

To Walk or Not to Walk: Crowdsourced Assessment of External Vehicle-to-Pedestrian Displays

Researchers, technology reviewers, and governmental agencies have expressed concern that automation may necessitate the introduction of added displays to indicate vehicle intent in vehicle-to-pedestrian interactions. An automated online methodology for obtaining communication intent perceptions for 30 external vehicle-to-pedestrian display concepts was implemented and tested using Amazon Mechan...

متن کامل

Continuous-Time Quantum Walk on the Line

Quantum walks have recently been introduced and investigated, with the hope that they may be useful in constructing new efficient quantum algorithms. For reviews of quantum walks, see Refs. [4, 16, 24]. There are two distinct types of the quantum walk: one is a discrete-time case [2, 5, 12, 14, 17, 18, 19, 22, 23], the other is a continuous-time case [1, 3, 7, 8, 10, 15, 20]. The quantum walk c...

متن کامل

Transient Nn Random Walk on the Line

We prove strong theorems for the local time at in nity of a nearest neighbor transient random walk. First, laws of the iterated logarithm are given for the large values of the local time. Then we investigate the length of intervals over which the walk runs through (always from left to right) without ever returning. AMS 2000 Subject Classi cation: Primary 60G50; Secondary 60F15, 60J55.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Vision

سال: 2018

ISSN: 1534-7362

DOI: 10.1167/18.10.484